On Skyline Queries and How to Choose from Pareto Sets
نویسندگان
چکیده
Skyline queries are well known for their intuitive query formalization and easy to understand semantics when selecting the most interesting database objects in a personalized fashion. They naturally fill the gap between set-based SQL queries and rank-aware database retrieval and thus have emerged in the last few years as a popular tool for personalized retrieval in the database research community. Unfortunately, the Skyline paradigm also exhibits some significant drawbacks. Most prevalent among those problems is the so called “curse of dimensionality” which often leads to unmanageable result set sizes. This flood of query results, usually containing a significant portion of the original database, in turn severely hampers the paradigm’s applicability in real-life systems. In this chapter, we will provide a survey of techniques to remedy this problem by choosing the most interesting objects from the multitude of skyline objects in order to obtain truly manageable and personalized query results.
منابع مشابه
Efficient Skyline Queries under Weak Pareto Dominance
Skylines with partial order preference semantics often result in huge answer sets and what is worse, they cannot be computed efficiently. In this paper we will explore the evaluation of so-called restricted skyline queries with partial order preferences under the paradigm of weak Pareto dominance. Weak Pareto dominance removes all objects from skylines, which are dominated by other objects in s...
متن کاملGetting Prime Cuts from Skylines over Partially Ordered Domains
Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numerical preferences, preferences over discrete value domains do not show an inherent total order, but have to rely on partial orders as stated by the user. In such orders typically many object values are incomparable, increa...
متن کاملPreference Trade-Offs - Towards Manageable Skylines
Skyline queries are generally considered as a promising technique for mitigating the challenges posed by the ever growing amount of available information. However, despite nearly a decade of research, the application of the Skyline paradigm in real-world information systems still failed to succeed. This fact was mainly attributed to two major problems: the poor performance of the employed algor...
متن کاملEfficient skyline refinement using trade-offs respecting don't care attributes
Skyline Queries have received a lot of attention due to their intuitive query formulation. Following the concept of Pareto optimality all ‘best’ database items satisfying different aspects of the query are returned to the user. However, this often results in huge result set sizes. In everyday’s life users face the same problem. But here, when confronted with a too large variety of choices users...
متن کاملProbabilistic Skyline Queries over Uncertain Moving Objects
Data uncertainty inherently exists in a large number of applications due to factors such as limitations of measuring equipments, update delay, and network bandwidth. Recently, modeling and querying uncertain data have attracted considerable attention from the database community. However, how to perform advanced analysis on uncertain data remains an interesting question. In this paper, we focus ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013